0.00/0.01	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : supatvars_int
0.00/0.01	% Ordering    : kbo
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --sup-at-vars \
0.00/0.01	  --ho-no-ext-pos \
0.00/0.01	  --ho-no-ext-neg \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.20	% Computer   : n100.star.cs.uiowa.edu
0.00/0.20	% Model      : x86_64 x86_64
0.00/0.20	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.20	% Memory     : 32218.625MB
0.00/0.20	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.20	% CPULimit   : 300
0.00/0.20	% DateTime   : Fri Feb  2 17:14:25 CST 2018
0.00/0.21	% done 9 iterations in 0.003s
0.00/0.21	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.21	% SZS output start Refutation
0.00/0.21	tff(singletonsuniq, conjecture,
0.00/0.21	  (setadjoinIL =>
0.00/0.21	   (uniqinunit =>
0.00/0.21	    (![Xx,Xy]:
0.00/0.21	       ((setadjoin(Xx,emptyset) = setadjoin(Xy,emptyset)) => (Xx = Xy)))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (setadjoinIL =>
0.00/0.21	     (uniqinunit =>
0.00/0.21	      (![Xx,Xy]:
0.00/0.21	         ((setadjoin(Xx,emptyset) = setadjoin(Xy,emptyset)) => (Xx = Xy))))))).
0.00/0.21	tff('0', plain, setadjoin(sk_Xx2, emptyset) = setadjoin(sk_Xy2, emptyset),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff(setadjoinIL, axiom,
0.00/0.21	  (setadjoinIL <=> (![Xx,Xy]: in(Xx,setadjoin(Xx,Xy))))).
0.00/0.21	tff('1', plain, ![X0, X1]: (in(X0, setadjoin(X0, X1)) | ~ setadjoinIL),
0.00/0.21	    inference('cnf', [status(esa)], [setadjoinIL])).
0.00/0.21	tff('2', plain, setadjoinIL, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('3', plain, ![X0, X1]: (in(X0, setadjoin(X0, X1)) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['1', '2'])).
0.00/0.21	tff('4', plain, ![X0, X1]: in(X0, setadjoin(X0, X1)),
0.00/0.21	    inference('simplify', [status(thm)], ['3'])).
0.00/0.21	tff('5', plain, in(sk_Xy2, setadjoin(sk_Xx2, emptyset)),
0.00/0.21	    inference('sup+', [status(thm)], ['0', '4'])).
0.00/0.21	tff(uniqinunit, axiom,
0.00/0.21	  (uniqinunit <=> (![Xx,Xy]: (in(Xx,setadjoin(Xy,emptyset)) => (Xx = Xy))))).
0.00/0.21	tff('6', plain,
0.00/0.21	    ![X2, X3]: (~ in(X2, setadjoin(X3, emptyset)) | X2 = X3 | ~ uniqinunit),
0.00/0.21	    inference('cnf', [status(esa)], [uniqinunit])).
0.00/0.21	tff('7', plain, uniqinunit, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('8', plain,
0.00/0.21	    ![X2, X3]: (~ in(X2, setadjoin(X3, emptyset)) | X2 = X3 | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['6', '7'])).
0.00/0.21	tff('9', plain, ![X2, X3]: (X2 = X3 | ~ in(X2, setadjoin(X3, emptyset))),
0.00/0.21	    inference('simplify', [status(thm)], ['8'])).
0.00/0.21	tff('10', plain, (~ $true | sk_Xy2 = sk_Xx2),
0.00/0.21	    inference('sup-', [status(thm)], ['5', '9'])).
0.00/0.21	tff('11', plain, sk_Xy2 = sk_Xx2,
0.00/0.21	    inference('simplify', [status(thm)], ['10'])).
0.00/0.21	tff('12', plain, sk_Xx2 != sk_Xy2,
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('13', plain, $false,
0.00/0.21	    inference('simplify_reflect-', [status(thm)], ['11', '12'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
